Security - Problem Solved?
نویسندگان
چکیده
منابع مشابه
Web Services Security: is the problem solved?
During the past years significant standardization work in web services technology has been made. As a consequence of these initial efforts, web services foundational stable specifications have already been delivered. Now, it is time for the industry to standardize and address the security issues that have risen from this paradigm. Great activity is being carried out on this subject. This articl...
متن کاملIs Scheduling a Solved Problem?
In recent years, scheduling research has had an increasing impact on practical problems, and a range of scheduling techniques have made their way into realworld application development. Constraint-based models now couple rich representational flexibility with highly scalable constraint management and search procedures. Similarly, mathematical programming tools are now capable of addressing prob...
متن کاملPhenylketonuria (PKU): A problem solved?
Phenylketonuria (PKU) is a rare metabolic disorder characterized by impaired conversion of phenylalanine (Phe) to tyrosine. If left untreated, the resultant accumulation of excess blood Phe can cause physiological, neurological, and intellectual disabilities. The National PKU Alliance (NPKUA) conducted a survey of its membership to assess current health status and interest in new treatments for...
متن کاملBit Preservation: A Solved Problem?
For years, discussions of digital preservation have routinely featured comments such as “bit preservation is a solved problem; the real issues are ... ”. Indeed, current digital storage technologies are not just astoundingly cheap and capacious, they are astonishingly reliable. Unfortunately, these attributes drive a kind of “Parkinson’s Law” of storage, in which demands continually push beyond...
متن کاملPacking Graphs: The packing problem solved
Abstract For every fixed graph H, we determine the H-packing number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P (H, Kn) = b 2h b n − 1 d cc, unless n = 1 mod d and n(n − 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P (H, Kn) = b 2h b n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2005
ISSN: 1542-7730,1542-7749
DOI: 10.1145/1071713.1071728